Discovering Association Rules in Semi-structured Data Sets
نویسندگان
چکیده
The discovery of association rules is one of the classic problems of data mining. Typically, it is done over well-structured data, such as databases. In this paper, we present a method of discovery of association rules in semi-structured data, namely, in a set of conceptual graphs. The method is based on conceptual clustering of the data and constructing of a conceptual hierarchy. A feature of the method is the possibility of using different levels of generalization.
منابع مشابه
I Inter-transactional Association Analysis for Prediction
The discovery of association rules from large amounts of structured or semi-structured data is an important datamining problem (Agrawal et al., 1993; Agrawal & Srikant, 1994; Braga et al., 2002, 2003; Cong et al., 2002; Miyahara et al., 2001; Termier et al., 2002; Xiao et al., 2003). It has crucial applications in decision support and marketing strategy. The most prototypical application of ass...
متن کاملExtensions from Intratransaction to Intertransaction Associations
The discovery of association rules from large amounts of structured or semi-structured data is an important datamining problem (Agrawal et al., 1993; Agrawal & Srikant, 1994; Braga et al., 2002, 2003; Cong et al., 2002; Miyahara et al., 2001; Termier et al., 2002; Xiao et al., 2003). It has crucial applications in decision support and marketing strategy. The most prototypical application of ass...
متن کاملXML-Enabled Association Analysis
The discovery of association rules from large amounts of structured or semi-structured data is an important data mining problem [Agrawal et al. 1993, Agrawal and Srikant 1994, Miyahara et al. 2001, Termier et al. 2002, Braga et al. 2002, Cong et al. 2002, Braga et al. 2003, Xiao et al. 2003, Maruyama and Uehara 2000, Wang and Liu 2000]. It has crucial applications in decision support and market...
متن کاملEfficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data
In this paper, we review recent advances in efficient algorithms for semi-structured data mining , that is, discovery of rules and patterns from structured data such as sets, sequences, trees, and graphs. After introducing basic definitions and problems, We present efficent algorithms for frequent and maximal pattern mining for classes of sets, sequences, and trees. In particular, we explain ge...
متن کاملSurvey on Mining in Semi-Structured Data
Emerging technologies of semi-structured data have attracted wide attention of networks, e-commerce, information retrieval and databases. In these applications, the data are modeled not as static collections but as transient data streams, where the data source is an unbounded stream of individual data items. It is becoming increasingly popular to send heterogeneous and ill-structured data throu...
متن کامل